The Use of Proof Planning for Co-operative Theorem Proving
نویسندگان
چکیده
منابع مشابه
The Use of Proof Planning for Co-operative Theorem Proving
We describe BARNACLE: a cooperative interface to an inductive theorem prover. The cooperative nature of the BARNACLE interface is made possible by proof planning. Proof planning is a technique for guiding the search for a proof in automatic theorem proving. Common patterns of reasoning in proofs are identified and represented computationa.lly as proof plans. These proof plans are then used to g...
متن کاملthe use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولAssertion Application in Theorem Proving and Proof Planning
Our work addresses assertion retrieval and application in theorem proving systems or proof planning systems for classical first-order logic. We propose a distributed mediator M between a mathematical knowledge base KB and a theorem proving system TP which is independent of the particular proof and knowledge representation formats of TP and KB and which applies generalized resolution in order to...
متن کاملProof Documents for Automated Origami Theorem Proving
A proof document for origami theorem proving is a record of entire process of reasoning about origami construction and theorem proving. It is produced at the completion of origami theorem proving as a kind of proof certificate. It describes in detail how the whole process of an origami construction and the subsequent theorem proving are carried out in our computational origami system. In partic...
متن کاملProving Ground Completeness of Resolution by Proof Planning Proving Ground Completeness of Resolution by Proof Planning
A lot of the human ability to prove hard mathematical theorems can be ascribed to a domain-speciic problem solving know-how. Such knowledge is intrin-sically incomplete. In order to solve related problems, human mathematicians can go beyond their acquired knowledge by adapting their know-how. These two aspects, having rich experience and extending it by need, can be simulated in a proof plannin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1998
ISSN: 0747-7171
DOI: 10.1006/jsco.1997.0174